On the Entropy of a Two Step Random Fibonacci Substitution

نویسنده

  • Johan Nilsson
چکیده

We consider a random generalization of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping, a 7→ baa and b 7→ ab, with probability p, and b 7→ ba, with probability 1 − p for 0 < p < 1, and where the random rule is applied each time it acts on a b. We show that the topological entropy of this object is given by the growth rate of the set of inflated random Fibonacci words, and we exactly calculate its value.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Abelian Sequenceable Groups Involving ?-Covers

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...

متن کامل

On a Family of Random Noble Means Substitutions

In 1989, Godrèche and Luck [1] introduced the concept of local mixtures of primitive substitution rules along the example of the well-known Fibonacci substitution and foreshadowed heuristic results on the topological entropy and the spectral type of the diffraction measure of associated point sets. In this contribution, we present a generalisation of this concept by regarding the so-called ‘nob...

متن کامل

Substitution Dynamics

generate recursively the infinite Prouhet-Thue-Morse word 0110100110010110 and Fibonacci word 01001010010010100101, respectively [1]. What can be said about the entropy (loosely, the amount of disorder) if we introduce some randomness into such definitions? If [2, 3] ⎨⎩ 0→ 1⁄2 01 with probability 12 10 with probability 12 1→ 0 with independence assumed throughout, then the set of possi...

متن کامل

Balanced Acceptance Sampling+m: A Balance Between Entropy and Spatially Balance

Balanced acceptance sampling is a relatively new sampling scheme that has potential to improve the efficiency of spatial studies. There are two drawbacks of the design, it can have low entropy and some of the unbiased estimates can not be calculated. In this paper, such shortcomings have been addressed by integrating simple random sampling with balanced acceptance sampling. In a simulation stud...

متن کامل

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Entropy

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2013